# Introduction:
Department

Here are preliminary results of the bibliometric mapping of the 2022 Luxembourg research evaluation. Its purpose is:

The method for the research-field-mapping can be reiviewed here:

Rakas, M., & Hain, D. S. (2019). The state of innovation system research: What happens beneath the surface?. Research Policy, 48(9), 103787.

Seed Articles

The seed articles deemed representative for the active areas of research in the institution, and include authors affiliated with the institution. They can be selected in three ways:

  1. Via bibliographic clustering of the institutions publications and selection of most central articles per cluster (only clsuters where n >= 0.05N). Selection can be found at: https://github.com/daniel-hain/biblio_lux_2022/blob/master/output/seed/scopus_list_itis_seed.csv
  2. Manual selection of relevant publications.
  3. A combination of 1. and 2.

The present analysis is based on the following seed articles:

AU PY TI JI
DA SILVA SERAPIÃO LEAL G;GU… 2020 A SEMI-AUTOMATED SYSTEM FOR INTEROPERABILITY ASSESSMENT: AN ONTOLOGY-BASED APPROACH ENTERP. INF. SYST.
REZGUI D;BOUZIRI H;AGGOUNE-… 2019 A HYBRID EVOLUTIONARY ALGORITHM FOR SMART FREIGHT DELIVERY WITH ELECTRIC MODULAR VEHICLES PROC. IEEE/ACS INT. CONF. C…
LAHURE C;MAQUIL V 2018 SLOWING DOWN INTERACTIONS ON TANGIBLE TABLETOP INTERFACES: A COMPARATIVE USER STUDY IN THE CONTEX… I-COM
BARAFORT B;SHRESTHA A;CORTI… 2018 A SOFTWARE ARTEFACT TO SUPPORT STANDARD-BASED PROCESS ASSESSMENT: EVOLUTION OF THE TIPA® FRAMEWOR… COMPUT STAND INTERFACES
VAN GILS B;PROPER HA 2018 ENTERPRISE MODELLING IN THE AGE OF DIGITAL TRANSFORMATION LECT. NOTES BUS. INF. PROCESS.
MAYER N;FELTUS C 2017 EVALUATION OF THE RISK AND SECURITY OVERLAY OF ARCHIMATE TO MODEL INFORMATION SYSTEM SECURITY RISKS PROC IEE INT. ENTERPRISE DI…

Topic modelling

Here, we report the results of a LDA topic-modelling (basically, clustering on words) on all title+abstract texts.

Topics by topwords

Note: While this static vies is helpful, I recommend using the interactive LDAVis version to be found under https://daniel-hain.github.io/biblio_lux_2022/output/topic_modelling/LDAviz_list_itis.rds/index.html#topic=1&lambda=0.60&term=. For functionality and usage, see technical description in the next tab.

Topics over time

Technical Description

LDA Topic Modelling

Topic modeling is a type of statistical modeling for discovering the abstract “topics” that occur in a collection of documents. Latent Dirichlet Allocation (LDA) is an example of topic model and is used to classify text in a document to a particular topic.

LDA is a generative probabilistic model that assumes each topic is a mixture over an underlying set of words, and each document is a mixture of over a set of topic probabilities. It builds a topic per document model and words per topic model, modeled as Dirichlet distributions.

LDAVis

LDAvis is a web-based interactive visualisation of topics estimated using LDA. It provides a global view of the topics (and how they differ from each other), while at the same time allowing for a deep inspection of the terms most highly associated with each individual topic. The package extracts information from a fitted LDA topic model to inform an interactive web-based visualization. The visualisation has two basic pieces.

The left panel visualise the topics as circles in the two-dimensional plane whose centres are determined by computing the Jensen–Shannon divergence between topics, and then by using multidimensional scaling to project the inter-topic distances onto two dimensions. Each topic’s overall prevalence is encoded using the areas of the circles.

The right panel depicts a horizontal bar chart whose bars represent the individual terms that are the most useful for interpreting the currently selected topic on the left. A pair of overlaid bars represent both the corpus-wide frequency of a given term as well as the topic-specific frequency of the term.

The \(\lambda\) slider allows to rank the terms according to term relevance. By default, the terms of a topic are ranked in decreasing order according their topic-specific probability ( \(\lambda\) = 1 ). Moving the slider allows to adjust the rank of terms based on much discriminatory (or “relevant”) are for the specific topic. The suggested optimal value of \(\lambda\) is 0.6.

Knowledge Bases: Co-Citation network analysis

Note: This analysis refers the co-citation analysis, where the cited references and not the original publications are the unit of analysis. See tab Technical descriptionfor additional explanations

Knowledge Bases summary

In order to partition networks into components or clusters, we deploy a community detection technique based on the Lovain Algorithm (Blondel et al., 2008). The Lovain Algorithm is a heuristic method that attempts to optimize the modularity of communities within a network by maximizing within- and minimizing between-community connectivity. We identify the following communities = knowledge bases.

com name dgr_int dgr
Knowledge Base 1: KB 1 (n = 1700, density =5.54)
1 VARGO S.L. LUSCH R.F. SERVICE-DOMINANT LOGIC: CONTINUING THE EVOLUTION (2008) 9650 9920
1 VARGO S.L. LUSCH R.F. EVOLVING TO A NEW DOMINANT LOGIC FOR MARKETING (2004) 8590 8864
1 VARGO S.L. LUSCH R.F. INSTITUTIONS AND AXIOMS: AN EXTENSION AND UPDATE OF SERVICE-DOMINANT LOGIC (2016) 7754 7884
1 GRÖNROOS C. VOIMA P. CRITICAL SERVICE LOGIC: MAKING SENSE OF VALUE CREATION AND CO-CREATION (2013) 6553 6615
1 VARGO S.L. MAGLIO P.P. AKAKA M.A. ON VALUE AND VALUE CO-CREATION: A SERVICE SYSTEMS AND SERVICE LOGIC PERSPECTIVE (2008) 3258 3338
1 PAYNE A.F. STORBACKA K. FROW P. MANAGING THE CO-CREATION OF VALUE (2008) 3243 3291
1 EDVARDSSON B. TRONVOLL B. GRUBER T. EXPANDING UNDERSTANDING OF SERVICE EXCHANGE AND VALUE CO-CREATION: A SOCIAL CONSTRUCTION APPROACH (2011) 2945 2964
1 LUSCH R.F. NAMBISAN S. SERVICE INNOVATION: A SERVICE-DOMINANT LOGIC PERSPECTIVE (2015) 2750 2946
1 PRAHALAD C.K. RAMASWAMY V. CO-CREATION EXPERIENCES: THE NEXT PRACTICE IN VALUE CREATION (2004) 2628 2647
1 CHANDLER J.D. VARGO S.L. CONTEXTUALIZATION AND VALUE-IN-CONTEXT: HOW CONTEXT FRAMES EXCHANGE (2011) 2551 2572
Knowledge Base 2: KB 2 (n = 971, density =4.39)
2 SOLOMON M.M. ALGORITHMS FOR THE VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS (1987) 3902 4961
2 DANTZIG G.B. RAMSER J.H. THE TRUCK DISPATCHING PROBLEM (1959) 1360 1866
2 BRÄYSY O. GENDREAU M. VEHICLE ROUTING PROBLEM WITH TIME WINDOWS PART I: ROUTE CONSTRUCTION AND LOCAL SEARCH ALGORITHMS (2005) 1221 1266
2 ROPKE S. PISINGER D. AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR THE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS (2006) 885 1376
2 BRÄYSY O. GENDREAU M. VEHICLE ROUTING PROBLEM WITH TIME WINDOWS PART II: METAHEURISTICS (2005) 642 652
2 CLARKE G. WRIGHT J.W. SCHEDULING OF VEHICLES FROM A CENTRAL DEPOT TO A NUMBER OF DELIVERY POINTS (1964) 620 928
2 OMBUKI B. ROSS B.J. HANSHAR F. MULTI-OBJECTIVE GENETIC ALGORITHMS FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (2006) 556 598
2 BALDACCI R. MINGOZZI A. ROBERTI R. RECENT EXACT ALGORITHMS FOR SOLVING THE VEHICLE ROUTING PROBLEM UNDER CAPACITY AND TIME WINDOW CONSTRAINTS (2012) 545 569
2 PISINGER D. ROPKE S. A GENERAL HEURISTIC FOR VEHICLE ROUTING PROBLEMS (2007) 516 719
2 NAGATA Y. BRÄYSY O. DULLAERT W. A PENALTY-BASED EDGE ASSEMBLY MEMETIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (2010) 474 524
Knowledge Base 3: KB 3 (n = 584, density =18.41)
3 SCHNEIDER M. STENGER A. GOEKE D. THE ELECTRIC VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS AND RECHARGING STATIONS (2014) 3029 3795
3 HIERMANN G. PUCHINGER J. ROPKE S. HARTL R.F. THE ELECTRIC FLEET SIZE AND MIX VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND RECHARGING STATIONS (2016) 2342 2746
3 GOEKE D. SCHNEIDER M. ROUTING A MIXED FLEET OF ELECTRIC AND CONVENTIONAL VEHICLES (2015) 2236 2560
3 DESAULNIERS G. ERRICO F. IRNICH S. SCHNEIDER M. EXACT ALGORITHMS FOR ELECTRIC VEHICLE-ROUTING PROBLEMS WITH TIME WINDOWS (2016) 1939 2267
3 KESKIN M. ÇATAY B. PARTIAL RECHARGE STRATEGIES FOR THE ELECTRIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (2016) 1763 2017
3 ERDOĞAN S. MILLER-HOOKS E. A GREEN VEHICLE ROUTING PROBLEM (2012) 1515 1737
3 MONTOYA A. GUÉRET C. MENDOZA J.E. VILLEGAS J.G. THE ELECTRIC VEHICLE ROUTING PROBLEM WITH NONLINEAR CHARGING FUNCTION (2017) 1379 1557
3 SCHIFFER M. WALTHER G. THE ELECTRIC LOCATION ROUTING PROBLEM WITH TIME WINDOWS AND PARTIAL RECHARGING (2017) 1323 1462
3 BRUGLIERI M. PEZZELLA F. PISACANE O. SURACI S. A VARIABLE NEIGHBORHOOD SEARCH BRANCHING FOR THE ELECTRIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS … 1288 1450
3 YANG J. SUN H. BATTERY SWAP STATION LOCATION-ROUTING PROBLEM WITH CAPACITATED ELECTRIC VEHICLES (2015) 1285 1423
Knowledge Base 4: KB 4 (n = 583, density =8.17)
4 HEVNER A.R. MARCH S.T. PARK J. RAM S. DESIGN SCIENCE IN INFORMATION SYSTEMS RESEARCH (2004) 2232 2565
4 PEFFERS K. TUUNANEN T. ROTHENBERGER M.A. CHATTERJEE S. A DESIGN SCIENCE RESEARCH METHODOLOGY FOR INFORMATION SYSTEMS RESEARCH (2007) 1761 1987
4 GREGOR S. HEVNER A.R. POSITIONING AND PRESENTING DESIGN SCIENCE RESEARCH FOR MAXIMUM IMPACT (2013) 1604 1820
4 GREGOR S. JONES D. THE ANATOMY OF A DESIGN THEORY (2007) 1296 1330
4 MARCH S.T. SMITH G.F. DESIGN AND NATURAL SCIENCE RESEARCH ON INFORMATION TECHNOLOGY (1995) 1005 1042
4 SEIN M.K. HENFRIDSSON O. PURAO S. ROSSI M. LINDGREN R. ACTION DESIGN RESEARCH (2011) 888 976
4 GREGOR S. THE NATURE OF THEORY IN INFORMATION SYSTEMS (2006) 615 645
4 IIVARI J. DISTINGUISHING AND CONTRASTING TWO STRATEGIES FOR DESIGN SCIENCE RESEARCH (2015) 572 578
4 VENABLE J. PRIES-HEJE J. BASKERVILLE R. FEDS: A FRAMEWORK FOR EVALUATION IN DESIGN SCIENCE RESEARCH (2016) 563 585
4 HEVNER A.R. A THREE CYCLE VIEW OF DESIGN SCIENCE RESEARCH (2007) 554 568
Knowledge Base 5: KB 5 (n = 309, density =6.74)
5 ZACHMAN J.A. A FRAMEWORK FOR INFORMATION SYSTEMS ARCHITECTURE (1987) 363 390
5 SCHMIDT C. BUXMANN P. OUTCOMES AND SUCCESS FACTORS OF ENTERPRISE IT ARCHITECTURE MANAGEMENT: EMPIRICAL INSIGHT FROM THE INTERNATIONAL FINANCIAL SER… 208 220
5 TAMM T. SEDDON P.B. SHANKS G. REYNOLDS P. HOW DOES ENTERPRISE ARCHITECTURE ADD VALUE TO ORGANISATIONS? (2011) 177 190
5 SIMON D. FISCHBACH K. SCHODER D. AN EXPLORATION OF ENTERPRISE ARCHITECTURE RESEARCH (2013) 134 142
5 LANKHORST M. (2013) 110 118
5 KARAGIANNIS D. MAYR H.C. MYLOPOULOS J. (2016) 109 112
5 FRANK U. DOMAIN-SPECIFIC MODELING LANGUAGES: REQUIREMENTS ANALYSIS AND DESIGN GUIDELINES (2013) 105 136
5 KARAGIANNIS D. KÜHN H. METAMODELLING PLATFORMS (2002) 98 98
5 SPEWAK S.H. HILL S.C. (1992) 83 83
5 ROSS J.W. WEILL P. ROBERTSON D.C. (2006) 81 87

Development of Knowledge Bases

Technical description

In a co-cittion network, the strength of the relationship between a reference pair \(m\) and \(n\) (\(s_{m,n}^{coc}\)) is expressed by the number of publications \(C\) which are jointly citing reference \(m\) and \(n\).

\[s_{m,n}^{coc} = \sum_i c_{i,m} c_{i,n}\]

The intuition here is that references which are frequently cited together are likely to share commonalities in theory, topic, methodology, or context. It can be interpreted as a measure of similarity as evaluated by other researchers that decide to jointly cite both references. Because the publication process is time-consuming, co-citation is a backward-looking measure, which is appropriate to map the relationship between core literature of a field.

Research Areas: Bibliographic coupling analysis

Research Areas main summary

This is arguably the more interesting part. Here, we identify the literature’s current knowledge frontier by carrying out a bibliographic coupling analysis of the publications in our corpus. This measure uses bibliographical information of publications to establish a similarity relationship between them. Again, method details to be found in the tab Technical description. As you will see, we identify the main research area, but also a set of adjacent research areas with some theoretical/methodological/application overlap.

To identify communities in the field’s knowledge frontier (labeled research areas) we again use the Lovain Algorithm (Blondel et al., 2008). We identify the following communities = research areas.

com_name AU PY TI dgr_int TC TC_year
Research Area 1: RA 1 (n = 638, density =0.45)
RA 1 VENABLE J;PRIES-HEJE J… 2016 FEDS: A FRAMEWORK FOR EVALUATION IN DESIGN SCIENCE RESEARCH 2.93 393 65.50
RA 1 PEFFERS K;TUUNANEN T;N… 2018 DESIGN SCIENCE RESEARCH GENRES: INTRODUCTION TO THE SPECIAL ISSUE ON EXEMPLARS AND CRITERIA FOR APPLICABLE DESIGN SCIENCE … 6.17 92 23.00
RA 1 HYVÄRINEN H;RISIUS M;F… 2017 A BLOCKCHAIN-BASED APPROACH TOWARDS OVERCOMING FINANCIAL FRAUD IN PUBLIC SECTOR SERVICES 5.39 93 18.60
RA 1 SANTOS MY;OLIVEIRA E S… 2017 A BIG DATA SYSTEM SUPPORTING BOSCH BRAGA INDUSTRY 4.0 STRATEGY 4.53 106 21.20
RA 1 GHOLAMI R;WATSON RT;MO… 2016 INFORMATION SYSTEMS SOLUTIONS FOR ENVIRONMENTAL SUSTAINABILITY: HOW CAN WE DO MORE? 4.12 111 18.50
RA 1 BASKERVILLE R;BAIYERE … 2018 DESIGN SCIENCE RESEARCH CONTRIBUTIONS: FINDING A BALANCE BETWEEN ARTIFACT AND THEORY 2.54 179 44.75
RA 1 ANDROUTSOPOULOU A;KARA… 2019 TRANSFORMING THE COMMUNICATION BETWEEN CITIZENS AND GOVERNMENT THROUGH AI-GUIDED CHATBOTS 3.34 133 44.33
RA 1 VOM BROCKE J;WINTER R;… 2020 SPECIAL ISSUE EDITORIAL – ACCUMULATION AND EVOLUTION OF DESIGN KNOWLEDGE IN DESIGN SCIENCE RESEARCH: A JOURNEY THROUGH TIM… 6.12 69 34.50
RA 1 ENGELENBURG S;JANSSEN … 2019 DESIGN OF A SOFTWARE ARCHITECTURE SUPPORTING BUSINESS-TO-GOVERNMENT INFORMATION SHARING TO IMPROVE PUBLIC SAFETY AND SECUR… 5.73 66 22.00
RA 1 GRENHA TEIXEIRA J;PATR… 2017 THE MINDS METHOD: INTEGRATING MANAGEMENT AND INTERACTION DESIGN PERSPECTIVES FOR SERVICE DESIGN 4.02 92 18.40
Research Area 2: RA 2 (n = 630, density =1.27)
RA 2 VARGO SL;LUSCH RF 2016 INSTITUTIONS AND AXIOMS: AN EXTENSION AND UPDATE OF SERVICE-DOMINANT LOGIC 5.32 1515 252.50
RA 2 VARGO SL;LUSCH RF 2017 SERVICE-DOMINANT LOGIC 2025 6.84 522 104.40
RA 2 RAMASWAMY V;OZCAN K 2018 WHAT IS CO-CREATION? AN INTERACTIONAL CREATION FRAMEWORK AND ITS IMPLICATIONS FOR VALUE CREATION 13.91 224 56.00
RA 2 CHATHOTH PK;UNGSON GR;… 2016 CO-CREATION AND HIGHER ORDER CUSTOMER ENGAGEMENT IN HOSPITALITY AND TOURISM SERVICES: A CRITICAL REVIEW 11.43 202 33.67
RA 2 BEIRÃO G;PATRÍCIO L;FI… 2017 VALUE COCREATION IN SERVICE ECOSYSTEMS: INVESTIGATING HEALTH CARE AT THE MICRO, MESO, AND MACRO LEVELS 15.74 125 25.00
RA 2 ALVES H;FERNANDES C;RA… 2016 VALUE CO-CREATION: CONCEPT AND CONTEXTS OF APPLICATION AND STUDY 14.66 134 22.33
RA 2 MEYNHARDT T;CHANDLER J… 2016 SYSTEMIC PRINCIPLES OF VALUE CO-CREATION: SYNERGETICS OF VALUE AND SERVICE ECOSYSTEMS 18.53 95 15.83
RA 2 ALEXANDER MJ;JAAKKOLA … 2018 ZOOMING OUT: ACTOR ENGAGEMENT BEYOND THE DYADIC 14.44 116 29.00
RA 2 KOSKELA-HUOTARI K;EDVA… 2016 INNOVATION IN SERVICE ECOSYSTEMS-BREAKING, MAKING, AND MAINTAINING INSTITUTIONALIZED RULES OF RESOURCE INTEGRATION 9.74 164 27.33
RA 2 BRODIE RJ;FEHRER JA;JA… 2019 ACTOR ENGAGEMENT IN NETWORKS: DEFINING THE CONCEPTUAL DOMAIN 14.13 113 37.67
Research Area 3: RA 3 (n = 552, density =0.44)
RA 3 HIERMANN G;PUCHINGER J… 2016 THE ELECTRIC FLEET SIZE AND MIX VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND RECHARGING STATIONS 5.84 270 45.00
RA 3 UCHOA E;PECIN D;PESSOA… 2017 NEW BENCHMARK INSTANCES FOR THE CAPACITATED VEHICLE ROUTING PROBLEM 4.95 161 32.20
RA 3 HU C;LU J;LIU X;ZHANG G 2018 ROBUST VEHICLE ROUTING PROBLEM WITH HARD TIME WINDOWS UNDER DEMAND AND TRAVEL TIME UNCERTAINTY 11.13 66 16.50
RA 3 SHI Y;BOUDOUH T;GRUNDER O 2017 A HYBRID GENETIC ALGORITHM FOR A HOME HEALTH CARE ROUTING PROBLEM WITH TIME WINDOW AND FUZZY DEMAND 5.57 102 20.40
RA 3 NALEPA J;BLOCHO M 2016 ADAPTIVE MEMETIC ALGORITHM FOR MINIMIZING DISTANCE IN THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS 7.23 75 12.50
RA 3 CISSÉ M;YALÇINDAĞ S;KE… 2017 OR PROBLEMS RELATED TO HOME HEALTH CARE: A REVIEW OF RELEVANT ROUTING AND SCHEDULING PROBLEMS 4.35 110 22.00
RA 3 CHEN S;CHEN R;WANG G-G… 2018 AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR DYNAMIC VEHICLE ROUTING PROBLEMS 6.45 68 17.00
RA 3 ERRICO F;DESAULNIERS G… 2016 A PRIORI OPTIMIZATION WITH RECOURSE FOR THE VEHICLE ROUTING PROBLEM WITH HARD TIME WINDOWS AND STOCHASTIC SERVICE TIMES 5.17 73 12.17
RA 3 GOEL R;MAINI R 2018 A HYBRID OF ANT COLONY AND FIREFLY ALGORITHMS (HAFA) FOR SOLVING VEHICLE ROUTING PROBLEMS 4.43 82 20.50
RA 3 KOÇ Ç;BEKTAŞ T;JABALI … 2016 THE FLEET SIZE AND MIX LOCATION-ROUTING PROBLEM WITH TIME WINDOWS: FORMULATIONS AND A HEURISTIC ALGORITHM 4.96 72 12.00
Research Area 4: RA 4 (n = 347, density =1.33)
RA 4 MONTOYA A;GUÉRET C;MEN… 2017 THE ELECTRIC VEHICLE ROUTING PROBLEM WITH NONLINEAR CHARGING FUNCTION 13.41 191 38.20
RA 4 DESAULNIERS G;ERRICO F… 2016 EXACT ALGORITHMS FOR ELECTRIC VEHICLE-ROUTING PROBLEMS WITH TIME WINDOWS 8.42 195 32.50
RA 4 DORLING K;HEINRICHS J;… 2017 VEHICLE ROUTING PROBLEMS FOR DRONE DELIVERY 3.57 447 89.40
RA 4 SCHIFFER M;WALTHER G 2017 THE ELECTRIC LOCATION ROUTING PROBLEM WITH TIME WINDOWS AND PARTIAL RECHARGING 10.28 142 28.40
RA 4 KESKIN M;ÇATAY B 2016 PARTIAL RECHARGE STRATEGIES FOR THE ELECTRIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS 4.79 216 36.00
RA 4 HOF J;SCHNEIDER M;GOEKE D 2017 SOLVING THE BATTERY SWAP STATION LOCATION-ROUTING PROBLEM WITH CAPACITATED ELECTRIC VEHICLES USING AN AVNS ALGORITHM FOR V… 8.36 120 24.00
RA 4 MACRINA G;DI PUGLIA PU… 2019 THE GREEN MIXED FLEET VEHICLE ROUTING PROBLEM WITH PARTIAL BATTERY RECHARGING AND TIME WINDOWS 14.17 68 22.67
RA 4 SCHIFFER M;WALTHER G 2018 STRATEGIC PLANNING OF ELECTRIC LOGISTICS FLEET NETWORKS: A ROBUST LOCATION-ROUTING APPROACH 13.17 71 17.75
RA 4 KESKIN M;ÇATAY B 2018 A MATHEURISTIC METHOD FOR THE ELECTRIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND FAST CHARGERS 12.15 75 18.75
RA 4 PELLETIER S;JABALI O;L… 2017 BATTERY DEGRADATION AND BEHAVIOUR FOR ELECTRIC VEHICLES: REVIEW AND NUMERICAL ANALYSES OF SEVERAL MODELS 4.98 171 34.20
Research Area 5: RA 5 (n = 329, density =0.83)
RA 5 LEWIS JR 2018 THE SYSTEM USABILITY SCALE: PAST, PRESENT, AND FUTURE 5.66 261 65.25
RA 5 HARRATI N;BOUCHRIKA I;… 2016 EXPLORING USER SATISFACTION FOR E-LEARNING SYSTEMS VIA USAGE-BASED METRICS AND SYSTEM USABILITY SCALE ANALYSIS 5.08 124 20.67
RA 5 LEWIS JR 2018 MEASURING PERCEIVED USABILITY: THE CSUQ, SUS, AND UMUX 7.23 67 16.75
RA 5 GAO M;KORTUM P;OSWALD F 2018 PSYCHOMETRIC EVALUATION OF THE USE (USEFULNESS, SATISFACTION, AND EASE OF USE) QUESTIONNAIRE FOR RELIABILITY AND VALIDITY 9.08 52 13.00
RA 5 MELNICK ER;DYRBYE LN;S… 2020 THE ASSOCIATION BETWEEN PERCEIVED ELECTRONIC HEALTH RECORD USABILITY AND PROFESSIONAL BURNOUT AMONG US PHYSICIANS 4.44 103 51.50
RA 5 GEORGSSON M;STAGGERS N 2016 QUANTIFYING USABILITY: AN EVALUATION OF A DIABETES MHEALTH SYSTEM ON EFFECTIVENESS, EFFICIENCY, AND SATISFACTION METRICS W… 4.03 100 16.67
RA 5 FARIA AL;ANDRADE A;SOA… 2016 BENEFITS OF VIRTUAL REALITY BASED COGNITIVE REHABILITATION THROUGH SIMULATED ACTIVITIES OF DAILY LIVING: A RANDOMIZED CONT… 2.80 108 18.00
RA 5 KLEIBOER A;SMIT J;BOSM… 2016 EUROPEAN COMPARATIVE EFFECTIVENESS RESEARCH ON BLENDED DEPRESSION TREATMENT VERSUS TREATMENT-AS-USUAL (E-COMPARED): STUDY … 3.30 89 14.83
RA 5 REYNOLDS J;SMITH T;REE… 2018 A TALE OF TWO STUDIES: THE BEST AND WORST OF YUBIKEY USABILITY 7.98 33 8.25
RA 5 KOOISTRA LC;RUWAARD J;… 2016 DEVELOPMENT AND INITIAL EVALUATION OF BLENDED COGNITIVE BEHAVIOURAL TREATMENT FOR MAJOR DEPRESSION IN ROUTINE SPECIALIZED … 5.07 44 7.33
Research Area 6: RA 6 (n = 280, density =0.14)
RA 6 LAPALME J;GERBER A;VAN… 2016 EXPLORING THE FUTURE OF ENTERPRISE ARCHITECTURE: A ZACHMAN PERSPECTIVE 0.46 75 12.50
RA 6 SHANKS G;GLOET M;ASADI… 2018 ACHIEVING BENEFITS WITH ENTERPRISE ARCHITECTURE 0.52 60 15.00
RA 6 FIGL K 2017 COMPREHENSION OF PROCEDURAL VISUAL BUSINESS PROCESS MODELS: A LITERATURE REVIEW 0.39 72 14.40
RA 6 DA SILVA SERAPIÃO LEAL… 2019 INTEROPERABILITY ASSESSMENT: A SYSTEMATIC LITERATURE REVIEW 0.69 41 13.67
RA 6 KOTUSEV S 2019 ENTERPRISE ARCHITECTURE AND ENTERPRISE ARCHITECTURE ARTIFACTS: QUESTIONING THE OLD CONCEPT IN LIGHT OF NEW FINDINGS 1.31 21 7.00
RA 6 PANETTO H;ZDRAVKOVIC M… 2016 NEW PERSPECTIVES FOR THE FUTURE INTEROPERABLE ENTERPRISE SYSTEMS 0.31 88 14.67
RA 6 CANCINO CA;LA PAZ AI;R… 2018 TECHNOLOGICAL INNOVATION FOR SUSTAINABLE GROWTH: AN ONTOLOGICAL PERSPECTIVE 0.40 69 17.25
RA 6 CAMERON JD;RAMAPRASAD … 2017 AN ONTOLOGY OF AND ROADMAP FOR MHEALTH RESEARCH 0.47 52 10.40
RA 6 NIKNAM M;KARSHENAS S 2017 A SHARED ONTOLOGY APPROACH TO SEMANTIC REPRESENTATION OF BIM DATA 0.41 60 12.00
RA 6 NEGRI E;FUMAGALLI L;GA… 2016 REQUIREMENTS AND LANGUAGES FOR THE SEMANTIC REPRESENTATION OF MANUFACTURING SYSTEMS 0.32 74 12.33
Research Area 7: RA 7 (n = 187, density =1.87)
RA 7 BLATTGERSTE J;STRENGE … 2017 COMPARING CONVENTIONAL AND AUGMENTED REALITY INSTRUCTIONS FOR MANUAL ASSEMBLY TASKS 6.38 93 18.60
RA 7 PAPACHRISTOS NM;VRELLI… 2017 A COMPARISON BETWEEN OCULUS RIFT AND A LOW-COST SMARTPHONE VR HEADSET: IMMERSIVE USER EXPERIENCE AND LEARNING 7.40 34 6.80
RA 7 MILLAIS P;JONES SL;KEL… 2018 EXPLORING DATA IN VIRTUAL REALITY: COMPARISONS WITH 2D DATA VISUALIZATIONS 7.10 30 7.50
RA 7 STADLER S;KAIN K;GIULI… 2016 AUGMENTED REALITY FOR INDUSTRIAL ROBOT PROGRAMMERS: WORKLOAD ANALYSIS FOR TASK-BASED, AUGMENTED REALITY-SUPPORTED ROBOT CO… 5.64 32 5.33
RA 7 ROTH D;LUGRIN J-L;BUSE… 2016 A SIMPLIFIED INVERSE KINEMATIC APPROACH FOR EMBODIED VR APPLICATIONS 6.48 27 4.50
RA 7 KOSCH T;HASSIB M;BUSCH… 2018 LOOK INTO MY EYES: USING PUPIL DILATION TO ESTIMATE MENTAL WORKLOAD FOR TASK COMPLEXITY ADAPTATION 7.18 23 5.75
RA 7 LONGO L 2018 EXPERIENCED MENTAL WORKLOAD, PERCEPTION OF USABILITY, THEIR INTERACTION AND IMPACT ON TASK PERFORMANCE 3.33 40 10.00
RA 7 CHEN Z;MALPANI A;CHALA… 2016 VIRTUAL FIXTURE ASSISTANCE FOR NEEDLE PASSING AND KNOT TYING 5.65 21 3.50
RA 7 HU JSL;LU J;TAN WB;LOM… 2016 TRAINING IMPROVES LAPAROSCOPIC TASKS PERFORMANCE AND DECREASES OPERATOR WORKLOAD 6.91 17 2.83
RA 7 SMITH M;GABBARD JL;BUR… 2017 THE EFFECTS OF AUGMENTED REALITY HEAD-UP DISPLAYS ON DRIVERS’ EYE SCAN PATTERNS, PERFORMANCE, AND PERCEPTIONS 7.29 16 3.20

Development

Connectivity between the research areas

Technical description

In a bibliographic coupling network, the coupling-strength between publications is determined by the number of commonly cited references they share, assuming a common pool of references to indicate similarity in context, methods, or theory. Formally, the strength of the relationship between a publication pair \(i\) and \(j\) (\(s_{i,j}^{bib}\)) is expressed by the number of commonly cited references.

\[s_{i,j}^{bib} = \sum_m c_{i,m} c_{j,m}\]

Since our corpus contains publications which differ strongly in terms of the number of cited references, we normalize the coupling strength by the Jaccard similarity coefficient. Here, we weight the intercept of two publications’ bibliography (shared refeences) by their union (number of all references cited by either \(i\) or \(j\)). It is bounded between zero and one, where one indicates the two publications to have an identical bibliography, and zero that they do not share any cited reference. Thereby, we prevent publications from having high coupling strength due to a large bibliography (e.g., literature surveys).

\[S_{i,j}^{jac-bib} =\frac{C(i \cap j)}{C(i \cup j)} = \frac{s_{i,j}^{bib}}{c_i + c_j - s_{i,j}^{bib}}\]

More recent articles have a higher pool of possible references to co-cite to, hence they are more likely to be coupled. Consequently, bibliographic coupling represents a forward looking measure, and the method of choice to identify the current knowledge frontier at the point of analysis.

Knowledge Bases, Research Areas & Topics Interaction

Endnotes

All results are preliminary so far…